Benchmark Results of a Genetic Algorithm for Non-permutation Flowshops Using Constrained Buffers*

نویسندگان

  • Gerrit Färber
  • Anna M. Coves Moreno
چکیده

This paper presents the performance study of a Genetic Algorithm, for the special case of a mixed model non-permutation flowshop production line, where resequencing is permitted when stations have access to intermittent or centralized resequencing buffers. The access to the buffers is restricted by the number of available buffer places and the physical size of the products. Results from other authors are compared which presented results on permutation sequences [1] or which treat a problem similar to the one studied in this work [2], based on the benchmark data provided by Taillard [3]. Improvements that come with the introduction of constrained resequencing buffers are highlighted.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Study of a Genetic Algorithm for Sequencing in Mixed Model Non-permutation Flowshops Using Constrained Buffers

This paper presents the performance study of a Genetic Algorithm applied to a mixed model non-permutation flowshop production line. Resequencing is permitted where stations have access to intermittent or centralized resequencing buffers. The access to the buffers is restricted by the number of available buffer places and the physical size of the products. Characteristics such as the difference ...

متن کامل

Genetic Algorithm for Sequencing in Mixed Model Non-Permutation Flowshops using Constrained Buffers

In the classical production line, only products with the same options were processed at once. Products of different models, providing distinct options, were either processed on a different line or major equipment modifications were necessary. For today’s production lines this is no longer desirable and more and more rise the necessity of manufacturing a variety of models on one line, motivated ...

متن کامل

A Hybrid Approach for Fuzzy Just-In-Time Flow Shop Scheduling with Limited Buffers and Deteriorating Jobs

This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...

متن کامل

An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation

In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...

متن کامل

Slope Stability Analysis Using a Self-Adaptive Genetic Algorithm

This paper introduces a methodology for soil slope stability analysis based on optimization, limit equilibrium principles and method of slices. In this study, the slope stability analysis problem is transformed into a constrained nonlinear optimization problem. To solve that, a Self-Adaptive Genetic Algorithm (GA) is utilized. In this study, the slope stability safety factors are the objective ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006